Model Compression for Resource-Constrained Mobile Robots
نویسندگان
چکیده
The number of mobile robots with constrained computing resources that need to execute complex machine learning models has been increasing during the past decade. Commonly, these rely on edge infrastructure accessible over wireless communication heavy computational tasks. However, might become unavailable and, consequently, oblige execution tasks robot. This work focuses making it possible by reducing complexity and total parameters pre-trained computer vision models. is achieved using model compression techniques such as Pruning Knowledge Distillation. These have strong theoretical practical foundations, but their combined usage not widely explored in literature. Therefore, this especially investigating effects combining two techniques. results reveal up 90% a can be removed without any considerable reduction model's accuracy.
منابع مشابه
Sparse Depth Sensing for Resource-Constrained Robots
We consider the case in which a robot has to navigate in an unknown environment, but does not have enough on-board power or payload to carry a traditional depth sensor (e.g., a 3D lidar) and thus can only acquire a few (pointwise) depth measurements. Therefore, we address the following question: is it possible to reconstruct the geometry of an unknown environment using sparse and incomplete dep...
متن کاملBRISK-Based Visual Feature Extraction for Resource Constrained Robots
We address the problem of devising vision-based feature extraction for the purpose of localisation on resource constrained robots that nonetheless require reasonably agile visual processing. We present modifications to a state-of-the-art Feature Extraction Algorithm (FEA) called Binary Robust Invariant Scalable Keypoints (BRISK) [8]. A key aspect of our contribution is the combined use of BRISK...
متن کاملCollaborative Delivery with Energy-Constrained Mobile Robots
We consider the problem of collectively delivering some message from a specified source to a designated target location in a graph, using multiple mobile agents. Each agent has a limited energy which constrains the distance it can move. Hence multiple agents need to collaborate to move the message, each agent handing over the message to the next agent to carry it forward. Given the positions of...
متن کاملA UNIFIED MODEL FOR RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM WITH UNCERTAIN ACTIVITY DURATIONS
In this paper we present a unified (probabilistic/possibilistic) model for resource-constrained project scheduling problem (RCPSP) with uncertain activity durations and a concept of a heuristic approach connected to the theoretical model. It is shown that the uncertainty management can be built into any heuristic algorithm developed to solve RCPSP with deterministic activity durations. The esse...
متن کاملAn Energy-efficient Mathematical Model for the Resource-constrained Project Scheduling Problem: An Evolutionary Algorithm
In this paper, we propose an energy-efficient mathematical model for the resource-constrained project scheduling problem to optimize makespan and consumption of energy, simultaneously. In the proposed model, resources are speed-scaling machines. The problem is NP-hard in the strong sense. Therefore, a multi-objective fruit fly optimization algorithm (MOFOA) is developed. The MOFOA uses the VIKO...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic proceedings in theoretical computer science
سال: 2022
ISSN: ['2075-2180']
DOI: https://doi.org/10.4204/eptcs.362.7